Particle Swarm Convergence: An Empirical Investigation (draft)

نویسندگان

  • Christopher W Cleghorn
  • Andries P Engelbrecht
چکیده

This paper performs a thorough empirical investigation of the conditions placed on particle swarm optimization control parameters to ensure convergent behavior. At present there exists a large number of theoretically derived parameter regions that will ensure particle convergence, however, selecting which region to utilize in practice is not obvious. The empirical study is carried out over a region slightly larger than that needed to contain all the relevant theoretically derived regions. It was found that there is a very strong correlation between one of the theoretically derived regions and the empirical evidence. It was also found that parameters near the edge of the theoretically derived region converge at a very slow rate, after an initial population explosion. Particle convergence is so slow, that in practice, the edge parameter settings should not really be considered useful as convergent parameter settings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Empirical Analysis of Convergence Related Particle Swarm Optimization

In this paper an extensive empirical analysis of recently introduced Particle Swarm Optimization algorithm with Convergence Related parameters (CR-PSO) is presented. The algorithm is tested on extended set of benchmarks and the results are compared to the PSO with time-varying acceleration coefficients (TVAC-PSO) and the standard genetic algorithm (GA). Key-Words: Global Optimization, Particle ...

متن کامل

Chaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks

Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...

متن کامل

An Empirical Comparison of Particle Swarm and Predator Prey Optimisation

In this paper we present and discuss the results of experimentally comparing the performance of several variants of the standard swarm particle optimiser and a new approach to swarm based optimisation. The new algorithm, which we call predator prey optimiser, combines the ideas of particle swarm optimisation with a predator prey inspired strategy, which is used to maintain diversity in the swar...

متن کامل

A Theoretical and Empirical Analysis of Convergence Related Particle Swarm Optimization

In this paper an extensive theoretical and empirical analysis of recently introduced Particle Swarm Optimization algorithm with Convergence Related parameters (CR-PSO) is presented. The convergence of the classical PSO algorithm is addressed in detail. The conditions that should be imposed on parameters of the algorithm in order for it to converge in mean-square have been derived. The practical...

متن کامل

Empirical Study of Particle Swarm Optimization

In this paper, we empirically study the performance of the particle swarm optimizer (PSO). Four different benchmark functions with asymmetric initial range settings are selected as testing functions. The experimental results illustrate the advantages and disadvantages of the PSO. Under all the testing cases, the PSO always converges very quickly towards the optimal positions but may slow its co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015